Step of Proof: decidable__or
9,38
postcript
pdf
Inference at
*
1
3
I
of proof for Lemma
decidable
or
:
1.
P
:
2.
Q
:
3.
P
4.
Q
(
P
Q
)
(
(
P
Q
))
latex
by ((((DNth 1 0)
CollapseTHENM (DNth 2 0))
)
CollapseTHEN ((Auto_aux (first_nat 1:n
C
) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
t
T
,
P
Q
,
,
x
:
A
.
B
(
x
)
Lemmas
not
wf
origin